Approximation Algorithm for Facility Location Problems
نویسندگان
چکیده
J. Stollsteimer, "A working model for plant numbers and locations," Journal of Farm Economics, vol. 45, pp. 631–645, 1963. A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouse," Management Science, vol. 9, pp. 643–666, 1963. A. Manne, "A plant location and economy of scale decentralization and computation," Management Science, vol. 11, pp. 213–235, 1964. G. Cornuejola, G. L. Nemhauser, and L. Wolsey, "The uncapacitated facility location problem," In P. Mirchandani and R. Francis editors Discrete Location Theory John Wiley and Sons New York, pp. 119–171, 1990.
منابع مشابه
A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملApproximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions Approximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions
In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1 + , 1)-reduction of the facility location problem with subadditive costs to a soft capacitated facility location problem, which i...
متن کاملApproximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior
Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of t...
متن کاملApproximation Algorithms for Facility Location Problems
This paper surveys approximation algorithms for various facility location problems, mostly with detailed proofs. It resulted from lecture notes of a course held at the University of Bonn in the winter term 2004/2005.
متن کاملDistributed Approximation Algorithms for Facility Location Problems
In this paper, some distributed approximation algorithms for uncapacitated facility location problem and fault-tolerant facility location problem are summarized, respectively. The worst-case run time of the distributed version of the uncapacitated facility location problem is ( ) O n , where n is the number of network nodes. In addition, the approximation approach for the fault-tolerant facilit...
متن کاملA New Approximation Algorithm for the k-Facility Location Problem
The k-facility location problem is a common generalization of the facility location and the k-median problems. For the metric uncapacitated k-facility location problem, we propose a polynomial-time 2 + √ 3 + ǫ-approximation algorithm using the local search approach, which significantly improves the previously known approximation ratio 4, given by Jain et al. using the greedy method (J. ACM 50 (...
متن کامل